Techniques R Implementing Constraint Programming Systems Fo 3rd Workshop On
نویسندگان
چکیده
The search strategy of a CP solver is determined by the variable and value ordering heuristics it employs and by the branching scheme it follows. Although the effects of variable and value ordering heuristics on search effort have been widely studied, the effects of different branching schemes have received less attention. In this paper we study this effect through an experimental evaluation that includes standard branching schemes such as 2-way, d-way, and dichotomic domain splitting, as well as variations of set branching where branching is performed on sets of values. We also propose and evaluate a generic approach to set branching where the partition of a domain into sets is created using the scores assigned to values by a value ordering heuristic, and a clustering algorithm from machine learning. Experimental results demonstrate that although exponential differences between branching schemes, as predicted in theory between 2-way d-way branching, are not very common, still the choice of branching scheme can make quite a difference on certain classes of problems. Set branching methods are very competitive with 2-way branching and outperform it on some problem classes. A statistical analysis of the results reveals that our generic clustering-based set branching method is the best among the methods compared.
منابع مشابه
Systems integrating answer set programming and constraint programming
We will demonstrate two systems implementing subclasses of a new language AC(C). The language AC(C) not only has the problem modeling power of both Answer Set Prolog (ASP) and Constraint Logic Programming (CLP) but also allows for more efficient inference algorithms combining reasoning techniques from ASP and CLP systems.
متن کاملImplementing LP Systems with CP Techniques
This article gives an overview of my research activities since October 2012. It discusses various areas of logic programming with constraint programming as a common denominator.
متن کاملImplementing GraphQL as a Query Language for Deductive Databases in SWI-Prolog Using DCGs, Quasi Quotations, and Dicts
on (Constraint) Logic Programming and 24th International Workshop on Functional and (Constraint) Logic Programming (WLP’15/’16/WFLP’16). EPTCS 234, 2017, pp. 42–56, doi:10.4204/EPTCS.234.4 c © F. Nogatz & D. Seipel This work is licensed under the Creative Commons Attribution License. Implementing GraphQL as a Query Language for Deductive Databases in SWI–Prolog Using DCGs, Quasi Quotations, and...
متن کاملSaturne: a Reactive -anytime Programming Model for Intelligent Embedded Real-time Systems 3rd Ieee Workshop on Parallel and Distributed Real-time Systems Saturne: a Reactive -anytime Programming Model for Intelligent Embedded Real-time Systems
متن کامل
Constraint Processing Offers Improved Expressiveness and Inference for Interactive Expert Systems
Expert systems constitute one of the most successful application areas for Artificial Intelligence techniques; they have been deployed in many areas of industry and commerce. If-then rules are the core knowledge representation technology in currently deployed systems. However, if we replace rules by constraints, we get improved expressiveness in knowledge representation and richer inference.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010